Zoning search using a hyper-heuristic algorithm
نویسندگان
چکیده
منابع مشابه
A cooperative hyper-heuristic search framework
In this paper, we aim to investigate the role of cooperation between low level heuristics within a hyper-heuristic framework. Since different low level heuristics have different strengths and weaknesses, we believe that cooperation can allow the strengths of one low level heuristic to compensate for the weaknesses of another. We propose an agent-based cooperative hyper-heuristic framework compo...
متن کاملHySST: Hyper-heuristic Search Strategies and Timetabling
High school timetabling (HST) is a well-known real-world combinatorial optimisation problem. It requires the scheduling of events and resources, such as courses, classes of students, teachers, rooms and more within a fixed number of time slots subject to a set of constraints. In a standard fashion, constraints are separated into ‘hard’ and soft. The hard constraints must be satisfied in order t...
متن کاملMulti-objective Hyper-heuristic Evolutionary Algorithm
This paper presents a Multi-objective Hyper-heuristic Evolutionary Algorithm (MHypEA) for the solution of Scheduling and Inspection Planning in Software Development Projects. Scheduling and Inspection planning is a vital problem in software engineering whose main objective is to schedule the persons to various activities in the software development process such as coding, inspection, testing an...
متن کاملHybrid Adaptive Evolutionary Algorithm Hyper Heuristic
This paper presents a hyper heuristic that is able to adapt two low level parameters (depth of search rate and mutation intensity) and the probability of applying a low level heuristic to an evolving solution in order to improve the solution quality. Basically, two random subsets of heuristics are maintained: one sub set of the full set of heuristics and other sub-set of the local heuristics. F...
متن کاملInteractive Heuristic Search Algorithm
In this paper we present a hybrid heuristic search algorithm for constraint satisfaction problems. This algorithm was proposed as a mixture of two basic approaches: local search and backtrack based search. One of its major advantages is interactive behaviour in the sense of changing the task during the search. We present the results using the well known n-queens problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9539-6